Automatic Question Generation for HMM State Tying using a Feature Table

نویسندگان

  • Supphanat Kanokphara
  • Julie Carson-Berndsen
چکیده

Generally, speech recognition systems use context-dependent subword units for recognition. To utilize these units, tree-based state tying is an unavoidable technique. This tying applies linguistic questions to group these units and ties them accordingly. These questions usually require an expensive resource-consumption manual procedure. Even though this problem has been addressed by data-driven automatic question generation systems, the quality of the systems greatly depends on the quality of the corpus. This paper presents a new approach to automatically assign questions using only a simple feature table which has three advantages. First, the requirement for expert knowledge is reduced to only a simple feature table instead of complex questions. Consequently, question extension or modification is effortless. Second, feature tables still preserve a benefit of tree-based state tying, i.e. incorporating linguistic knowledge into questions. Third, feature tables are commonly employed in phonetic studies for all languages. It is therefore a resource which is easy to access.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature-Table-Based Automatic Question Generation for Tree-Based State Tying: A Practical Implementation

This paper presents a system for automatically generating linguistic questions based on a feature table. Such questions are an essential input for tree-based state tying, a technique which is widely used in speech recognition. In general, in order to utilize this technique, linguistic (or more accurately phonetic) questions have to be carefully defined. This may be extremely time consuming and ...

متن کامل

Asynchronous-transition HMM

We propose a new class of hidden Markov model (HMM) called asynchronous-transition HMM (AT-HMM). Opposed to conventional HMMs where hidden state transition occurs simultaneously to all features, the new class of HMM allows state transitions asynchronized between individual features to better model asynchronous timings of acoustic feature changes. In this paper, we focus on a particular class of...

متن کامل

Comparison among Various Question Generations for Decision Tree Based State Tying in Persian Language

Performance of any continuous speech recognition system is highly dependent on performance of the acoustic models. Generally, development of the robust spoken language technology relies on the availability of large amounts of data. Common way to cope with little data for training each state of Markov models is treebased state tying. This tying method applies contextual questions to tie states. ...

متن کامل

Memory space reduction for hidden Markov models in low-resource speech recognition systems

Low-cost recognition systems based on hidden Markov models (HMM) for mobile speech recognizers (mobile phones, PDAs) have a limited quantity of memory and processing power. Furthermore, the resources have to be shared between several applications. In this paper memory efficient HMMs were investigated for low-cost recognition platforms. The feature parameter tying HMM and subspace distribution c...

متن کامل

HMM-based speech recognition using decision trees instead of GMMs

In this paper, we experiment with decision trees as replacements for Gaussian mixture models to compute the observation likelihoods for a given HMM state in a speech recognition system. Decision trees have a number of advantageous properties, such as that they do not impose restrictions on the number or types of features, and that they automatically perform feature selection. In fact, due to th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003